#include <stdio.h>
//digui qiujie feibonaqishu
int FindFabo(int n)
{
	if (n <= 2)
	{
		return 1;
	}
	else
		return FindFabo(n - 1) + FindFabo(n - 2);
}
int main()
{
	int num = 0;
	scanf_s("%d", &num);
	int ret = FindFabo(num);
	//xunhuan jie fa 
	int a = 1, b = 1;
	int c = 0;
	num -= 2;
	while (num--)
	{
		c = a + b;
		a = b;
		b = c;
	}
	printf("%d\n", ret);
	printf("%d", c);
	return 0;
}